Welcome！[Sign In] ！[Sign Up]！
Front-page it | Collect it | [中国-简体中文]
FAQ Fav
Location:
Search - balance tree

Search list

[Graph program] AVLTree_demo

Description: avl平衡树，很好用的数据结构，对建立索引有帮助-avl balance tree, very good data structure,will be helpful for creating index.
Platform: | Size: 55029 | Author: 应名 | Hits:

[Other resource] BalTree

Description: 平衡树基类.可以通过继承重载建立自己需要的平衡树结构-balance tree base class. Heavy succession through the establishment of their own needs, the balance tree structure
Platform: | Size: 4638 | Author: lk | Hits:

[Other resource] Balance-Bi-Tree

Description: 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance - Bi-Tree data structure Balance - Bi-Tr ee data structure Balance - Bi-Tree data structure Balance - Bi-Tr
Platform: | Size: 7577 | Author: yang | Hits:

[Other resource] balance_tree_operation

Description: balance tree operation
Platform: | Size: 2146 | Author: zhanglin | Hits:

[JSP/Java] tree

Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Platform: | Size: 1797 | Author: 记忆超 | Hits:

[Other resource] bin_tree_demo

Description: 二叉平衡树算法，包括二叉平衡树的数据结构定义、创建、插入、查找、删除、释放内存等方法。-two forks balanced tree algorithms, including two forks balance tree data structure definition, create, insert, search, delete, release methods such as memory.
Platform: | Size: 20425 | Author: 何智峰 | Hits:

[Data structs] BST BBT

Description: 数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T's average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of the outstanding balance of two fork-tree and balanced binary tree s
Platform: | Size: 4096 | Author: 洪玲叶 | Hits:

[Graph program] AVLTree_demo

Description: avl平衡树，很好用的数据结构，对建立索引有帮助-avl balance tree, very good data structure,will be helpful for creating index.
Platform: | Size: 54272 | Author: 应名 | Hits:

[Data structs] BalTree

Description: 平衡树基类.可以通过继承重载建立自己需要的平衡树结构-balance tree base class. Heavy succession through the establishment of their own needs, the balance tree structure
Platform: | Size: 4096 | Author: lk | Hits:

[Data structs] Balance-Bi-Tree

Description: 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tree 数据结构 Balance-Bi-Tr-data structure Balance- Bi-Tree data structure Balance- Bi-Tr ee data structure Balance- Bi-Tree data structure Balance- Bi-Tr
Platform: | Size: 7168 | Author: yang | Hits:

[source in ebook] balance_tree_operation

Description: balance tree operation
Platform: | Size: 2048 | Author: zhanglin | Hits:

[Other] E64_0230

Description: 平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Insert the available balance transform inverse transform.
Platform: | Size: 40960 | Author: 苏言暖 | Hits:

[JSP/Java] tree

Description: 用 java实现的 搜索二叉树的插入、删除、遍历和平衡，是自己用与数据结构考试编写的 ，对数的相关编程很有用-java with the realization of the binary tree search, insert, delete, and traverse balance, and the use of their own data structure prepared by the examination of a number of useful programming
Platform: | Size: 2048 | Author: 记忆超 | Hits:

[Data structs] Splay

Description: 伸展树 都知道如果使用二叉查找树树平衡度不好则会降低查询效率，所以我们要维护二叉树的平衡性，即TreapTree 、SplayTree 、AVL、红黑等，本文介绍伸展树的平衡原理和核心代码 -Tree stretching all know if you use binary search tree tree balance will not reduce the query efficiency, and therefore we have to safeguard the balance tree that TreapTree, SplayTree, AVL, red and black, etc. This article describes the principle of extending the balance of the tree and the core code
Platform: | Size: 188416 | Author: sql | Hits:

[Data structs] AVLtree

Description: 经典数据结构算法实现 平衡二叉树的建立和维护-Classical data structure binary tree algorithm to achieve a balance of the establishment and maintenance of
Platform: | Size: 278528 | Author: nido | Hits:

[Data structs] avt

Description: 1.本程序演示平衡二叉树的插入,删除,查找,。 2.首先要先初始二叉树为空树； 3.接着要实现平衡二叉树的插入，删除，，其中根据平衡二叉树插入，删除的算法要不停的把插入的元素平衡地插入，需要调用平衡分析函数和左右旋转函数，更新平衡二叉树；删除元素后也要调用平衡分析函数和左右旋转函数，更新平衡二叉树。 4.平衡二叉树的查找则可根据查找算法实现。比较简单。-1. This procedure demonstration balanced binary tree insertion, delete, find,. 2. First of all, the initial first binary tree is empty tree 3. And then to achieve a balanced binary tree insertion, deletion, which under the balanced binary tree insertion, deletion of the algorithm to keep the inserted element balanced insertion, the need to call about a balanced analysis of function and rotating functions, balanced binary tree update delete elements have to call after the balance analysis functions and rotation function, update the balance tree. 4. Balanced binary tree can be the basis of the search algorithm to find. Relatively simple.
Platform: | Size: 260096 | Author: 张欣 | Hits:

[Data structs] avl_Tree

Description: 一个用C++实现的平衡二叉树算法，实现了高度、平衡度、父子节点等-A use of C++ to achieve a balanced binary tree algorithm, to achieve a high degree of balance, such as father and son nodes
Platform: | Size: 578560 | Author: liao | Hits:

[Data structs] balance-tree

Description: 平衡树算法的实现，功能为平衡树算法的实现-balance tree
Platform: | Size: 1024 | Author: 宗畅 | Hits:

[Software Engineering] Size-Balance-Tree-and-Treap-ADT

Description: Size Balance Tree和Treap的ADT接口和实现，使用心得和大家分享一下-Size Balance, Tree and Treap the ADT interface and implementation, use the experience and share with you
Platform: | Size: 7168 | Author: jinhui | Hits:

[Data structs] balance-tree

Description: 数据结构中对平衡二叉树的算法描述，自己编写的，不足之处见谅-balance tree
Platform: | Size: 2048 | Author: 月出 | Hits:
« 12 3 4 5 6 »

CodeBus www.codebus.net